[This topic is pre-release documentation and is subject to change in future releases. Blank topics are included as placeholders.]
Computes the union of this bag with another bag. The union of two bags
is all items from both of the bags. If an item appears X times in one bag,
and Y times in the other bag, the union contains the item Maximum(X,Y) times. This bag receives
the union of the two bags, the other bag is unchanged.
Namespace: Wintellect.PowerCollections
Assembly:
PowerCollections (in PowerCollections.dll)
Syntax
| C# |
|---|
public void UnionWith( OrderedBag<T> otherBag ) |
| Visual Basic (Declaration) |
|---|
Public Sub UnionWith ( _ otherBag As OrderedBag(Of T) _ ) |
| Visual C++ |
|---|
public: void UnionWith ( OrderedBag<T>^ otherBag ) |
Parameters
- otherBag
- OrderedBag<(Of <T>)>
Bag to union with.
Remarks
The union of two bags is computed in time O(M + N log M), where M is the size of the larger bag, and N is the size of the smaller bag.
Exceptions
| Exception | Condition |
|---|---|
| System..::InvalidOperationException | This bag and otherBag don't use the same method for comparing items. |
| System..::ArgumentNullException | otherBag is null. |
See Also
OrderedBag<(Of <T>)> Class
Wintellect.PowerCollections Namespace
Send comments about this topic to Microsoft.